Vertically countable spheres and their wild sets

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cohesive Sets: Countable and Uncountable

We show that many uncountable admissible ordinals (including some cardinals) as well as all countable admissible ordinals have cohesive subsets. Exactly which cardinals have cohesive subsets, however, is shown to depend on set-theoretic assumptions such as V=L or a large cardinal axiom. The study of recursion theory on the ordinals was initiated by Takeuti and then generalized by several others...

متن کامل

Countable Sets and Hessenberg’s Theorem

The papers [20], [16], [3], [11], [9], [15], [5], [8], [7], [21], [19], [2], [1], [10], [22], [12], [13], [18], [14], [17], [4], and [6] provide the terminology and notation for this paper. For simplicity we follow the rules: X, Y are sets, D is a non-empty set, m, n, n1, n2, n3, m2, m1 are natural numbers, A, B are ordinal numbers, L, K, M , N are cardinal numbers, x is arbitrary, and f is a f...

متن کامل

Borel Sets and Countable Models

We show that certain families of sets and functions related to a countable structure A are analytic subsets of a Polish space. Examples include sets of automorphisms, endomorphisms and congruences of A and sets of the combinatorial nature such as coloring of countable plain graphs and domino tiling of the plane. This implies, without any additional set-theoretical assumptions, i.e., in ZFC alon...

متن کامل

Stationary countable dense random sets

We study the probability theory of countable dense random subsets of (uncountably infinite) Polish spaces. It is shown that if such a set is stationary with respect to a transitive (locally compact) group of symmetries then any event which concerns the random set itself (rather than accidental details of its construction) must have probability zero or one. Indeed the result requires only quasi-...

متن کامل

Partitioning Pairs of Countable Sets

We make the translations of our partitions from [3] in the context of all countable subsets of a fixed uncountable set. A different translation was obtained recently by Velleman [4]. The purpose of this paper is to define a two-cardinal version of one of our partitions from [3]. K 2 Theorem. For every uncountable set A there is a c : [[A] °] —► A such that, for every cofmal U Ç [A] ° and a in A...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1974

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1974.50.521